Finding a Path of Superlogarithmic Length
نویسندگان
چکیده
We consider the problem of finding a long, simple path in an undirected graph. We present a polynomial-time algorithm that finds a path of length Ω ( (logL/ log logL)2 ) , where L denotes the length of the longest simple path in the graph. This establishes the performance ratio O ( n(log logn/ logn)2 ) for the longest path problem, where n denotes the number of vertices in the graph.
منابع مشابه
Near-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملA New Method for Path Finding of Power Transmission Lines in Geospatial Information System Using Raster Networks and Minimum of Mean Algorithm
Currently path-finding methods, which are widely used in GIS, rely on finding a path, which the sum of pixels’ weights on the path would be less than the other paths. According to dependency between sum of pixels' weights and length of path, decrementing of sum of pixels' weights can not considered as a proper criterion for optimum path finding. In addition, path length is not regarded as an in...
متن کاملمسیریابی حرکت روبات‌های ماشین‌واره با روش پیشروی سریع
The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 32 شماره
صفحات -
تاریخ انتشار 2002